THE SERIALIZABILITY OF CONCURRENT DATABASE UPDATESPAPADIMITRIOU CH.1979; J. ASS. COMPUTG MACHIN.; USA; DA. 1979; VOL. 26; NO 4; PP. 631-653; BIBL. 22 REF.Article

ON THE COMPLEXITY OF EDGE TRAVERSING.PAPADIMITRIOU CH.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 3; PP. 544-554; BIBL. 15 REF.Article

A THEOREM IN DATABASE CONCURRENCY CONTROLPAPADIMITRIOU CH.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 4; PP. 998-1006; BIBL. 13 REF.Article

WORST-CASE AND PROBABILISTIC ANALYSIS OF A GEOMETRIC LOCATION PROBLEMPAPADIMITRIOU CH.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 3; PP. 542-557; BIBL. 23 REF.Article

OPTIMALITY OF THE FAST FOURIER TRANSFORMPAPADIMITRIOU CH.1979; J. ASS. COMPUTG MACHIN.; USA; DA. 1979; VOL. 26; NO 1; PP. 95-102; BIBL. 10 REF.Article

ON LINEAR CHARACTERIZATIONS OF COMBINATORIAL OPTIMIZATION PROBLEMSKARP RM; PAPADIMITRIOU CH.1982; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 4; PP. 620-632; BIBL. 24 REF.Article

THE CLIQUE PROBLEM FOR PLANAR GRAPHSPAPADIMITRIOU CH; YANNAKAKIS M.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 4-5; PP. 131-133; BIBL. 4 REF.Article

THE COMPLEXITY OF DISTRIBUTED CONCURRENCY CONTROLKANELLAKIS PC; PAPADIMITRIOU CH.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 185-197; BIBL. 15 REF.Conference Paper

LOCAL SEARCH FOR THE ASYMMETRIC TRAVELING SALESMAN PROBLEMKANELLAKIS PC; PAPADIMITRIOU CH.1980; OPER. RES.; ISSN 0030-364X; USA; DA. 1980; VOL. 28; NO 5; PP. 1086-1099; BIBL. 23 REF.Article

AN OPTIMALITY THEORY OF CONCURRENCY CONTROL FOR DATABASESKUNG HT; PAPADIMITRIOU CH.1979; ACM-SIGMOD 1979. INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA/1979/BOSTON MA; USA; BOSTON: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1979; PP. 116-126; BIBL. 14 REF.Conference Paper

WORST-CASE RATIOS FOR PLANAR GRAPHS AND THE METHOD OF INDUCTION ON FACESPAPADIMITRIOU CH; YANNAKAKIS M.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 358-363; BIBL. 17 REF.Conference Paper

SYMMETRIC SPACE-BOUNDED COMPUTATIONLEWIS HR; PAPADIMITRIOU CH.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 19; NO 2; PP. 161-187; BIBL. 23 REF.Article

A WORST-CASE ANALYSIS OF NEAREST NEIGHBOR SEARCHING BY PROJECTIONPAPADIMITRIOU CH; BENTLEY JL.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 470-482; BIBL. 13 REF.Conference Paper

SCHEDULING INTERVAL-ORDERED TASKSPAPADIMITRIOU CH; YANNAKAKIS M.1979; S.I.A.M.J. COMPUTG; USA; DA. 1979; VOL. 8; NO 3; PP. 405-409; BIBL. 10 REF.Article

ON THE COMPLEXITY OF LOCAL SEARCH FOR THE TRAVELING SALESMAN PROBLEM.PAPADIMITRIOU CH; STEIGLITZ K.1977; S.I.A.M. J. COMPTG; U.S.A.; DA. 1977; VOL. 6; NO 1; PP. 76-83; BIBL. 18 REF.Article

ON CONCURRENCY CONTROL BY MULTIPLE VERSIONSPAPADIMITRIOU CH; KANELLAKIS PC.1982; SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS/1982-03-29/LOS ANGELES CA; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1982; PP. 76-82; BIBL. 16 REF.Conference Paper

THE COMPLEXITY OF RESTRICTED SPANNING TREE PROBLEMSPAPADIMITRIOU CH; YANNAKAKIS M.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 2; PP. 285-309; BIBL. 18 REF.Article

ALGEBRAIC DEPENDENCIESYANNAKAKIS M; PAPADIMITRIOU CH.1982; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1982; VOL. 25; NO 1; PP. 2-41; BIBL. 16 REF.Article

ON MINIMAL EULERIAN GRAPHSPAPADIMITRIOU CH; YANNAKAKIS M.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 4; PP. 203-205; BIBL. 8 REF.Article

FLOWSHOP SCHEDULING WITH LIMITED TEMPORARY STORAGEPAPADIMITRIOU CH; KANELLAKIS PC.1980; J. ASS. COMPUTG MACHIN.; USA; DA. 1980; VOL. 27; NO 3; PP. 533-549; BIBL. 26 REF.Article

A FAST ALGORITHM FOR TESTING FOR SAFETY AND DETECTING DEADLOCKS IN LOCKED TRANSACTION SYSTEMSLIPSKI W JR; PAPADIMITRIOU CH.1981; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1981; VOL. 2; NO 3; PP. 211-226; BIBL. 12 REF.Article

HAMILTON PATHS IN GRID GRAPHSITAI A; PAPADIMITRIOU CH; SZWARCFITER JL et al.1982; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 4; PP. 676-686; BIBL. 10 REF.Article

LOCKING POLICIES: SAFETY AND FREEDOM FROM DEADLOCKYANNAKAKIS M; PAPADIMITRIOU CH; KUNG HT et al.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 286-297; BIBL. 18 REF.Conference Paper

THE COMPLEXITY OF TESTING WHETHER A GRAPHS IS A SUPERCONCENTRATORBLUM M; KARP RM; VORNBERGER O et al.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 4-5; PP. 164-167; BIBL. 8 REF.Article

The effects of toxic substances on the activated sludge microfaunaPAPADIMITRIOU, Ch; PALASKA, G; LAZARIDOU, M et al.Desalination (Amsterdam). 2007, Vol 211, Num 1-3, pp 177-191, issn 0011-9164, 15 p.Article